Generating Minimal Definite Descriptions

نویسنده

  • Claire Gardent
چکیده

The incremental algorithm introduced in (Dale and Reiter, 1995) for producing distinguishing descriptions does not always generate a minimal description. In this paper, I show that when generalised to sets of individuals and disjunctive properties, this approach might generate unnecessarily long and ambiguous and/or epistemically redundant descriptions. I then present an alternative, constraint-based algorithm and show that it builds on existing related algorithms in that (i) it produces minimal descriptions for sets of individuals using positive, negative and disjunctive properties, (ii) it straightforwardly generalises to n-ary relations and (iii) it is integrated with surface realisation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The or That: Definite and Demonstrative Descriptions in Second Language Acquisition

Since Heubner's (1985) pioneering study, there have been many studies on (mis) use/ non-use of articles by L2 learners from article-less and article languages. The present study investigated how Persian L2 learners of English produce and interpret English definite descriptions and demonstrative descriptions. It was assumed that definite and demonstrative descriptions share the same central sema...

متن کامل

2 1 Ju l 1 99 8 Certain generating subspaces for vertex operator algebras

Minimal generating subspaces of “weak PBW-type” for vertex operator algebras are studied and a procedure is developed for finding such subspaces. As applications, some results on generalized modules are obtained for vertex operator algebras that satisfy a certain condition, and a minimal generating space of weak PBW-type is produced for VL with L any positive-definite even lattice.

متن کامل

Combining Frequent and Discriminating Attributes in the Generation of Definite Descriptions

The semantic content determination or attribute selection of definite descriptions is one of the most traditional tasks in natural language generation. Algorithms of this kind are required to produce descriptions that are brief (or even minimal) and, at the same time, as close as possible to the choices made by human speakers. In this work we attempt to achieve a balance between brevity and hum...

متن کامل

Generating referring expressions with a unification grammar

A simple formalism is proposed to represent the contexts in which pronouns, definite/indefinite descriptions, and ordinal descriptions (e.g. 'the second book') can be used, and the way in which these expressions change the context. It is shown that referring expressions can be generated by a unification grammar provided that some phrase-structure rules are specially tailored to express entities...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002